#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=600;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    cin>>(str+1);
    LL len=strlen(str+1);
    LL sum=0;
    LL num0=0;
    LL num2=0;
    for(LL i=1;i<=len;i++){
        sum+=(str[i]-'0');
        if( (str[i]-'0')%2==0&&str[i]!='0' ) num2++;
        if(str[i]=='0') num0++;
    }
    if(sum%3!=0){
        cout<<"cyan"<<"\n";
    }
    else if(num0==0){
        cout<<"cyan"<<"\n";
    }
    else if(num0==1&&(num2==0)){
        cout<<"cyan"<<"\n";
    }
    else cout<<"red"<<"\n";
  }
return 0;
}
